-
1 coprime elements
Большой англо-русский и русско-английский словарь > coprime elements
-
2 coprime elements
Математика: взаимно простые элементы (копростые) -
3 coprime elements
мат.взаимно простые [копростые] элементы -
4 coprime
матем. взаимно простой coprime in the large functions ≈ взаимно простые в целом функции coprime moduli modulus ≈ взаимно простые модули - coprime continuations - coprime elements - coprime functions - coprime ideals - coprime integers - coprime numbers - coprime order - coprime polynomial -
5 взаимно простые элементы
coprime elements мат., relatively prime elementsРусско-английский научно-технический словарь Масловского > взаимно простые элементы
-
6 coprimes
матем. -
7 element
1) элемент, компонент, деталь, составная часть2) звено; блок; модуль3) устройство, узел4) орган5) датчик, первичный элемент6) элемент, параметр• -
8 взаимно простые элементы
Mathematics: coprime elements (копростые), relatively prime elementsУниверсальный русско-английский словарь > взаимно простые элементы
-
9 взаимно простые элементы
Большой англо-русский и русско-английский словарь > взаимно простые элементы
См. также в других словарях:
Coprime — In number theory, a branch of mathematics, two integers a and b are said to be coprime (also spelled co prime) or relatively prime if the only positive integer that evenly divides both of them is 1. This is the same thing as their greatest common … Wikipedia
Chinese remainder theorem — The Chinese remainder theorem is a result about congruences in number theory and its generalizations in abstract algebra. In its most basic form it concerned with determining n, given the remainders generated by division of n by several numbers.… … Wikipedia
Prime number — Prime redirects here. For other uses, see Prime (disambiguation). A prime number (or a prime) is a natural number greater than 1 that has no positive divisors other than 1 and itself. A natural number greater than 1 that is not a prime number is… … Wikipedia
Modular representation theory — is a branch of mathematics, and that part of representation theory that studies linear representations of finite group G over a field K of positive characteristic. As well as having applications to group theory, modular representations arise… … Wikipedia
Greatest common divisor — In mathematics, the greatest common divisor (gcd), also known as the greatest common factor (gcf), or highest common factor (hcf), of two or more non zero integers, is the largest positive integer that divides the numbers without a remainder. For … Wikipedia
Cyclic group — Group theory Group theory … Wikipedia
Dihedral group — This snowflake has the dihedral symmetry of a regular hexagon. In mathematics, a dihedral group is the group of symmetries of a regular polygon, including both rotations and reflections.[1] Dihedr … Wikipedia
Primitive root modulo n — In modular arithmetic, a branch of number theory, a primitive root modulo n is any number g with the property that any number coprime to n is congruent to a power of g (mod n ). That is, if g is a primitive root (mod n ) and gcd( a , n ) = 1,… … Wikipedia
Étale cohomology — In mathematics, the étale cohomology groups of an algebraic variety or scheme are algebraic analogues of the usual cohomology groups with finite coefficients of a topological space, introduced by Grothendieck in order to prove the Weil… … Wikipedia
Pythagorean triple — A Pythagorean triple consists of three positive integers a , b , and c , such that a 2 + b 2 = c 2. Such a triple is commonly written ( a , b , c ), and a well known example is (3, 4, 5). If ( a , b , c ) is a Pythagorean triple, then so is ( ka … Wikipedia
Merkle–Hellman knapsack cryptosystem — The Merkle–Hellman knapsack cryptosystem was one of the earliest public key cryptosystems invented by Ralph Merkle and Martin Hellman in 1978.[1] Although its ideas are elegant, and far simpler than RSA, it has been broken.[2] Contents 1… … Wikipedia